Load-Sharing Algorithm using Digital Parallel Communication
نویسندگان
چکیده
منابع مشابه
Load Information Sharing Policies in Communication-Intensive Parallel Applications
In this paper, we present a study of information sharing policies used by well-known load balancing systems. Our approach comes from analyzing the performance scalability of: response time (time of reaction against instabilities) and bandwidth, from a communication-intensive application context. We divided the policies into: Centralized or Distributed oriented; and Eager or Lazy load informatio...
متن کاملLoad Sharing with Parallel Priority Queues
For maximum efficiency in a multiprocessor system the load should be shared evenly over all processors, that is, there should be no idle processors when tasks are available. The delay in a load sharing algorithm is the larger of the maximum time that any processor can be idle before a task is assigned to it, and the maximum time that it must wait to be relieved of an excess task. A simple paral...
متن کاملParallel Genetic Algorithm Using Algorithmic Skeleton
Algorithmic skeleton has received attention as an efficient method of parallel programming in recent years. Using the method, the programmer can implement parallel programs easily. In this study, a set of efficient algorithmic skeletons is introduced for use in implementing parallel genetic algorithm (PGA).A performance modelis derived for each skeleton that makes the comparison of skeletons po...
متن کاملParallel Genetic Algorithm Using Algorithmic Skeleton
Algorithmic skeleton has received attention as an efficient method of parallel programming in recent years. Using the method, the programmer can implement parallel programs easily. In this study, a set of efficient algorithmic skeletons is introduced for use in implementing parallel genetic algorithm (PGA).A performance modelis derived for each skeleton that makes the comparison of skeletons po...
متن کاملParallel Bottom-up Evaluation of Datalog Progrm~ by Load Sharing Parallel Boitom·up Evaluanon of Datalog Programs by Load Sharing
We propose a method of parallelizing bottom-up-evaluation of logic programs. The method is distinguished by the fact that it is pUTe i.e., does not require interprocessor communication, or synchronization overhead. The method cannot be used to parallelize every logic progtam, but we syntactically characterize several classes of logic programs to which the method can be applied (e.g., the class ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Transactions of the Korean Institute of Power Electronics
سال: 2011
ISSN: 1229-2214
DOI: 10.6113/tkpe.2011.16.1.50